Search results for "Correlated equilibrium"

showing 5 items of 5 documents

On the Coincidence of the Feedback Nash and Stackelberg Equilibria in Economic Applications of Differential Games

2002

In this paper the scope of the applicability of the Stackelberg equilibrium concept in differential games is investigated. Firstly, conditions for obtaining the coincidence between the Stackelberg and Nash equilibria are defined in terms of the instantaneous pay-off function and the state equation of the game. Secondly, it is showed that for a class of differential games with state-interdependence both equilibria are identical independently of the player being the leader of the game. A survey of different economic models shows that this coincidence is going to occur for a good number of economic applications of differential games. This result appears because of the continuous-time setting i…

Computer Science::Computer Science and Game TheoryCorrelated equilibriumMathematical optimizationjel:D62Differential Games; Stationary Feedback Nash Equilibrium; Stationary Feedback Stackelberg Equilibrium; Coincidence.ComputingMilieux_PERSONALCOMPUTINGjel:C73Trembling hand perfect equilibriumjel:H41Differential games stationary feedback Nash equilibrium stationary feedback Stackelberg equilibrium.symbols.namesakeEquilibrium selectionNash equilibriumBest responsejel:Q20jel:Q30Repeated gameEconomicsStackelberg competitionsymbolsEpsilon-equilibriumMathematical economicsSSRN Electronic Journal
researchProduct

Computational Complexity and Communication: Coordination in Two-Player Games

2002

The main contribution of this paper is the development and application of cryptographic techniques to the design of strategic communication mechanisms. One of the main assumptions in cryptography is the limitation of the computational power available to agents. We introduce the concept of limited computational complexity, and by borrowing results from cryptography, we construct a communication protocol to establish that every correlated equilibrium of a two-person game with rational payoffs can be achieved by means of computationally restricted unmediated communication. This result provides an example in game theory where limitations of computational abilities of players are helpful in solv…

Computer Science::Computer Science and Game TheoryEconomics and EconometricsCorrelated equilibriumTheoretical computer scienceComputational complexity theorybusiness.industryCryptographyComputational resourceTuring machinesymbols.namesakeNash equilibriumsymbolsbusinessCommunications protocolGame theoryAlgorithmMathematicsEconometrica
researchProduct

Strong Quantum Solutions in Conflicting Interest Bayesian Games

2017

Quantum entanglement has been recently demonstrated as a useful resource in conflicting-interest games of incomplete information between two players, Alice and Bob [Pappa et al., Phys. Rev. Lett. 114, 020401 (2015)]. The general setting for such games is that of correlated strategies where the correlation between competing players is established through a trusted common adviser; however, players need not reveal their input to the adviser. So far, the quantum advantage in such games has been revealed in a restricted sense. Given a quantum correlated equilibrium strategy, one of the players can still receive a higher than quantum average payoff with some classically correlated equilibrium str…

PhysicsClass (set theory)Correlated equilibriumComputer Science::Computer Science and Game TheoryQuantum PhysicsBayesian probabilityStochastic gameFOS: Physical sciencesQuantum entanglement01 natural sciences010305 fluids & plasmasAlice and BobComplete information0103 physical sciencesStatistical physics010306 general physicsQuantum Physics (quant-ph)Mathematical economicsQuantum
researchProduct

Consensus in Noncooperative Dynamic Games: a Multi-Retailer Inventory Application

2008

We focus on Nash equilibria and Pareto optimal Nash equilibria for a finite horizon noncooperative dynamic game with a special structure of the stage cost. We study the existence of these solutions by proving that the game is a potential game. For the single-stage version of the game, we characterize the aforementioned solutions and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multistage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately, not necessarily Pareto op…

TheoryofComputation_MISCELLANEOUSComputer Science::Computer Science and Game TheoryCorrelated equilibriumSequential gameComputer scienceDynamic programmingSubgame perfect equilibriumsymbols.namesakeCoordination gameElectrical and Electronic EngineeringRisk dominanceFolk theoremPrice of stabilityNon-credible threatGame theoryCentipede gameImplementation theoryNon-cooperative gameInventoryNormal-form gameStochastic gameComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALComputer Science ApplicationsConsensus protocols; Dynamic programming; Game theory; InventoryConsensus protocolsZero-sum gameControl and Systems EngineeringNash equilibriumEquilibrium selectionBest responsesymbolsRepeated gameEpsilon-equilibriumConsensus protocols; Dynamic programming; Game theory; Inventory;Potential gameSolution conceptMathematical economicsGame theory
researchProduct

Noncooperative dynamic games for inventory applications: A consensus approach

2008

We focus on a finite horizon noncooperative dynamic game where the stage cost of a single player associated to a decision is a monotonically nonincreasing function of the total number of players making the same decision. For the single-stage version of the game, we characterize Nash equilibria and derive a consensus protocol that makes the players converge to the unique Pareto optimal Nash equilibrium. Such an equilibrium guarantees the interests of the players and is also social optimal in the set of Nash equilibria. For the multi-stage version of the game, we present an algorithm that converges to Nash equilibria, unfortunately not necessarily Pareto optimal. The algorithm returns a seque…

TheoryofComputation_MISCELLANEOUSDynamic gamesComputer Science::Computer Science and Game TheoryMathematical optimizationCorrelated equilibriumSequential gameConsensus ProtocolsComputer scienceA-priori; Consensus protocols; Dynamic games; Finite horizons; Inventory; Inventory systems; Joint decisions; Multi stages; Nash equilibrium; Pareto-optimal; Single stages; Unilateral improvementsSymmetric equilibriumOutcome (game theory)Joint decisionsNash equilibriumFinite horizonsMulti stagessymbols.namesakeBayesian gameSettore ING-INF/04 - AutomaticaPareto-optimalA-prioriCoordination gameFolk theoremPrice of stabilityRisk dominanceNon-credible threatConsensus Protocols Dynamic Programming Game Theory InventoryInventory systemsTraveler's dilemmaNormal-form gameStochastic gameInventoryComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERALMinimaxConsensus protocolsEquilibrium selectionNash equilibriumBest responseSingle stagesRepeated gamesymbolsEpsilon-equilibriumSettore MAT/09 - Ricerca OperativaSolution conceptDynamic Programming Game TheoryUnilateral improvementsMathematical economicsGame theoryConsensus Protocols; Dynamic Programming Game Theory; Inventory
researchProduct